Oblivious Transfer Is Symmetric
نویسندگان
چکیده
We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Crépeau and Sántha in 1991.
منابع مشابه
Oblivious Transfer from Weak Noisy Channels
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because in a cryptographic setting, these noisy channels must satisfy very strong security requirements. Unfair noisy channels, introduced by Damg̊ard, Kilian and Salvail [Eurocrypt ’99], reduce these limitations: They give the ...
متن کاملSymmetric Blind Decryption with Perfect Secrecy
A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plaintext message. Such schemes are useful, for example, for the implementation of privacy preserving encrypted file storages and payment systems. In terms of functionality, blind decryption is close to oblivious transfer. For noiseless channels, information-theoretical...
متن کاملTruly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
SFE requires expensive public key operations for each input bit of the function. This cost can be avoided by using tamper-proof hardware. However, all known efficient techniques require the hardware to have long-term secure storage and to be resistant to reset or duplication attacks. This is due to the intrinsic use of counters or erasures. Known techniques that use resettable tokens rely on ex...
متن کاملEfficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
Oblivious Transfer (OT) is a simple, yet fundamental primitive which suffices to achieve almost every cryptographic application. In a recent work (Latincrypt ‘15), Chou and Orlandi (CO) present the most efficient, fully UC-secure OT protocol to date and argue its security under the CDH assumption. Unfortunately, a subsequent work by Genc et al. (Eprint ‘17) exposes a flaw in their proof which r...
متن کاملOblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement
A (γ, δ)-elastic channel is a binary symmetric channel between a sender and a receiver where the error rate of an honest receiver is δ while the error rate of a dishonest receiver lies within the interval [γ, δ]. In this paper, we show that from any non-trivial elastic channel (i.e., 0 < γ < δ < 1 2 ) we can implement oblivious transfer with informationtheoretic security. This was previously (K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004